Data Structures for Reporting Extension Violations in a Query Range
نویسندگان
چکیده
Design Rule Checking (DRC) in VLSI design involves checking if a given VLSI layout satisfies a given set of rules, and reporting the violations if any. We propose data structures for reporting violations of the minimum extension rule in a query window of
منابع مشابه
Extending range queries and nearest neighbors
Given an initial rectangular range or k nearest neighbor (k-nn) query (using the L1 metric), we consider the problems of incrementally extending the query by increasing the size of the range, or by increasing k, and reporting the new points incorporated by each extension. Although both problems may be solved trivially by repeatedly applying a traditional range query or L1 k-nn algorithm, such s...
متن کاملExternal Memory Orthogonal Range Reporting with Fast Updates
In this paper we describe data structures for orthogonal range reporting in external memory that support fast update operations. The query costs either match the query costs of the best previously known data structures or differ by a small multiplicative factor.
متن کاملData Structures for Restricted Triangular Range Searching
We present data structures for triangular emptiness and reporting queries for a planar point set, where the query triangle contains the origin. The data structures use near-linear space and achieve polylogarithmic query times.
متن کاملNon-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کاملRange Searching in Categorical Data: Colored Range Searching on Grid
Range searching, a fundamental problem in numerous applications areas, has been widely studied in computational geometry and spatial databases. Given a set of geometric objects, a typical range query asks for reporting all the objects that intersect a query object. However in many applications, including databases and network routing, input objects are partitioned into categories and a query as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009